#define _CRT_SECURE_NO_WARNINGS

class Solution {
public:
    bool isSubsequence(string s, string t) {
        vector<vector<int>>dp(s.size() + 1, vector<int>(t.size() + 1, 0));
        for (int i = 1; i < s.size() + 1; i++)
        {
            for (int j = 1; j < t.size() + 1; j++)
            {
                if (s[i - 1] == t[j - 1])
                    dp[i][j] = dp[i - 1][j - 1] + 1;
                else
                    dp[i][j] = max(dp[i][j - 1], dp[i - 1][j]);
            }
        }
        if (dp[s.size()][t.size()] == s.size())
            return true;
        return false;
    }
};

class Solution {
public:
    int numDistinct(string s, string t) {
        vector<vector<int>>dp(s.size() + 1, vector<int>(t.size() + 1, 0));
        for (int i = 0; i < s.size() + 1; i++)
            dp[i][0] = 1;
        for (int i = 1; i < s.size() + 1; i++)
        {
            for (int j = 1; j < t.size() + 1; j++)
            {
                if (s[i - 1] == t[j - 1])
                    dp[i][j] = dp[i - 1][j - 1] + dp[i - 1][j];
                else
                    dp[i][j] = dp[i - 1][j];
            }
        }
        return dp[s.size()][t.size()];
    }
};